Minimizing the Weighted Number of Late Semi-Resumable Jobs with Deterministic Machine Availability Constraints
نویسنده
چکیده
We investigate the problem of minimizing the weighted number of tardy jobs on a single machine subject to availability constraints. We consider the case of semi-resumable jobs (1, hk|ri, sr − a| ∑ wiUi). We show that the problem is equivalent to a similar problem without availability constraints, but where the processing times of jobs are a stepwise function of their starting time. We design a Mixed Integer Linear Program (MILP) to model the problem and solve it with help of a commercial MILP solver. Computational experiments on randomly generated instances show that using this method allows solving optimally most 300-job problems within 1000 seconds, and provides excellent heuristic solutions in 100 seconds.
منابع مشابه
Models for Minimizing the Weighted Number of Late Jobs with Deterministic Machine Availability Constraints
We study the problem of minimizing the weighted number of tardy jobs on a single machine with deterministic machine availability constraints. We show that the cases with resumable and non-resumable jobs (1, hk|ri, nr − a| ∑ wiUi and 1, hk|ri, r − a| ∑ wiUi) can both be modeled as a more general scheduling problem, consisting in selecting and scheduling jobs on parallel machines subject to time ...
متن کاملA mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
This study investigates scheduling problems that occur when the weighted number of late jobs that are subject to deterministic machine availability constraints have to be minimized. These problems can be modeled as a more general job selection problem. Cases with resumable, non-resumable, and semi-resumable jobs as well as cases without availability constraints are investigated. The proposed ef...
متن کاملMinimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints
In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...
متن کاملStudy of Scheduling Problems with Machine Availability Constraint
In real world scheduling applications, machines might not be available during certain time periods due to deterministic or stochastic causes. In this article, the machine scheduling with availability constraints for both deterministic and stochastic cases with different environments, constraints and performance measures will be discussed. The existing body of research work in the literature wil...
متن کاملApproximation Schemes for Flow Shop Scheduling Problems with Machine Availabilty Constraints
This paper considers two-machine flow shop scheduling problems with machine availability constraints. When the processing of a job is interrupted by an unavailability period of a machine, we consider both the resumable scenario in which the processing can be resumed when the machine next becomes available, and the semi-resumable scenarios in which some proportion of the processing is repeated b...
متن کامل